The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs
نویسندگان
چکیده
منابع مشابه
Hamiltonian Connected Graphs Involving Forbidden Subgraphs
We consider the pair of graphs S and T such that every 3-connected {S, T}-free graph is hamiltonian connected. Such pairs are called hamiltonian connected pairs. We show three new hamiltonian connected pairs. Combing our results and a result of Shepherd, we conclude that if {S, T} is a pair of graphs such that every 2-connected {S, T}-free graph is hamiltonian then every 3-connected {S, T}-free...
متن کاملEvery 3-connected, essentially 11-connected line graph is Hamiltonian
Thomassen conjectured that every 4-connected line graph is Hamiltonian. A vertex cut X of G is essential if G−X has at least two non-trivial components. We prove that every 3-connected, essentially 11-connected line graph is Hamiltonian. Using Ryjác̆ek’s line graph closure, it follows that every 3-connected, essentially 11-connected claw-free graph is Hamiltonian. © 2005 Elsevier Inc. All rights...
متن کاملconnected cototal domination number of a graph
a dominating set $d subseteq v$ of a graph $g = (v,e)$ is said to be a connected cototal dominating set if $langle d rangle$ is connected and $langle v-d rangle neq phi$, contains no isolated vertices. a connected cototal dominating set is said to be minimal if no proper subset of $d$ is connected cototal dominating set. the connected cototal domination number $gamma_{ccl}(g)$ of $g$ is the min...
متن کاملEvery 4-connected line graph of a quasi claw-free graph is hamiltonian connected
Let G be a graph. For any two distinct vertices x and y in G, denote distG(x, y) the distance in G from x and y. For u, v ∈ V (G) with distG(u, v) = 2, denote JG(u, v) = {w ∈ NG(u)∩NG(v)|N(w) ⊆ N [u]∪ N [v]}. A graph G is claw-free if it contains no induced subgraph isomorphic to K1,3. A graph G is called quasi-claw-free if JG(u, v) 6= ∅ for any u, v ∈ V (G) with distG(u, v) = 2. Kriesell’s res...
متن کامل5-Connected Toroidal Graphs are Hamiltonian-Connected
The problem on the Hamiltonicity of graphs is well studied in discrete algorithm and graph theory, because of its relation to traveling salesman problem (TSP). Starting with Tutte’s result, stating that every 4-connected planar graph is Hamiltonian, several researchers have studied the Hamiltonicity of graphs on surfaces. Extending Tutte’s technique, Thomassen proved that every 4-connected plan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2006
ISSN: 0011-4642,1572-9141
DOI: 10.1007/s10587-006-0020-x